Vaisman Ternary Networks Reliability and Monte Carlo
نویسندگان
چکیده
In this chapter we consider a monotone binary system with ternary components. “Ternary” or (“trinary”) means that each component can be in one of three states: up, middle (mid) and down. It turns out that for this system exists a combinatorial invariant by means of which it is possible to count the number C(r; x) of system failure sets with a given number of r components in up, x components in down and the remaining components in state mid. This invariant is called ternary D-spectrum and it is an analogue of signature or D-spectrum for a binary systemwith binary components. Contrary to D-spectrum, it is not a single set of probabilities, but a collection of such sets. The r -th member of this collection resembles a D-spectrum computed for a special case for which r components are permanently turned into state up. If system (network) components are statistically independent and identical, and have probabilities p2, p1 and p0, to be in up, mid and down, respectively, then the ternary D-spectrum allows obtaining a simple formula for calculating system DOWN probability. We consider also so-called ternary importance spectrum by means of which it becomes possible to rank system components by their importance measures. These importance measures are similar to Birnbaum importance measures that are well-known in Reliability Theory. The chapter is concluded by a description of Monte Carlo procedures used for approximating the ternary spectra.
منابع مشابه
D-spectrum and Reliability of a Binary System With Ternary Components
We consider a monotone binary system with ternary components. ”Ternary” means that each component can be in one of three states: up, middle (mid) and down. Handling such systems is a hard task, even if a part of the components have no mid state. Nevertheless, the permutation Monte Carlo methods, that proved very useful for dealing with binary components, can be efficiently used also for ternary...
متن کاملEstimating Reliability in Mobile ad-hoc Networks Based on Monte Carlo Simulation (TECHNICAL NOTE)
Each system has its own definition of reliability. Reliability in mobile ad-hoc networks (MANET) could be interpreted as, the probability of reaching a message from a source node to destination, successfully. The variability and volatility of the MANET configuration makes typical reliability methods (e.g. reliability block diagram) inappropriate. It is because, no single structure or configurat...
متن کاملNetwork Reliability Monte Carlo With Nodes Subject to Failure
We extend the network reliability estimation methodology based on evolution (creation) Monte Carlo into four directions: (i) introducing unreliable nodes; (ii) adjusting the evolution process with merging to "closure" operation suitable for unreliable nodes; (iii) in case of numerical instability in computing convolutions, we suggest a special Monte Carlo algorithm based on importance sampling;...
متن کاملSplitting Sequential Monte Carlo for Efficient Unreliability Estimation of Highly Reliable Networks
Assessing the reliability of complex technological systems such as communication networks, transportation grids, and bridge networks is a difficult task. From a mathematical point of view, the problem of estimating network reliability belongs to the #P complexity class. As a consequence, no analytical solution for solving this problem in a reasonable time is known to exist and one has to rely o...
متن کاملA Bayesian Networks Approach to Reliability Analysis of a Launch Vehicle Liquid Propellant Engine
This paper presents an extension of Bayesian networks (BN) applied to reliability analysis of an open gas generator cycle Liquid propellant engine (OGLE) of launch vehicles. There are several methods for system reliability analysis such as RBD, FTA, FMEA, Markov Chains, and etc. But for complex systems such as LV, they are not all efficiently applicable due to failure dependencies between compo...
متن کامل